Arithmetic operation in a data processing system

ABSTRACT

An arithmetic operation in a data processing unit, preferably by iterative digit accumulations, is proposed. An approximate result of the arithmetic operation is computed iteratively. Concurrently at least two supplementary values of the approximate result of the arithmetic operation are computed, and the final result selected from one of the values of the approximate result and the at least two supplementary values of the arithmetic operation depending on the results of the last iteration step.

PRIORITY CLAIM

This application is a continuation of U.S. Pat. No. 9,348,796 entitled“ARITHMETIC OPERATION IN A DATA PROCESSING SYSTEM,” issued on May 24,2016, the disclosure of which is incorporated herein by reference in itsentirety for all purposes.

BACKGROUND

The present invention relates in general to data processing systems, andin particular, to a method and a system for performing an arithmeticoperation, preferably by iterative digit accumulations, in a dataprocessing unit.

Division, reciprocal, and square-root arithmetic operations decisivelyimpact the performance of a data processing algorithm. These operationsare usually performed using iterative algorithms such as the SRT(Sweeney, Robertson, and Tocher) algorithm, where result digits arecomputed sequentially using a given radix r (usually a power of 2). Theresult is computed iteratively, then eventually corrected, theneventually negated. The latter operations cannot be short-cut, since theneed of a correction is detected in the last iteration of thecomputation. Accumulation of digits with MSD (Most Significant Digit)first to produce a final result usually produces carry information andrequires the propagation of carries from one digit to the previous one.

Known solutions are to compute an intermediate result Q, and then runone more iteration to correct and/or negate. Another solution is tocompute two intermediate results Q and Q−1, and then run one moreiteration to negate eventually. The drawback of these solutions is thatthey include a supplementary iteration to correct and/or invert thefinal result. This supplementary iteration is described, for example, inU.S. Pat. No. 6,109,777.

EP 1,672,481 B1 describes an invention that relates to a division andsquare root arithmetic unit including a divider of a higher radix typeand a square root extractor of a lower radix type. This patent describeshow in designing a divider and a square root extractor, a device using asubtraction shift method or a subtraction separation method is generallyemployed to achieve a balance between performance and an amount ofhardware required for implementation. This algorithm carries out adivision by shifting a remainder or partial remainder and subtracting amultiple of a denominator (a divisor or a partially extracted squareroot) from the remainder to determine a quotient in a similar manner toa manual division calculation performed on paper. More specifically, aquotient or a number extracted from a square root is determined every ndigits to calculate a partial remainder on the basis of the determinedquotient or the extracted number from the square root. In the nextoperation step, the obtained partial remainder is shifted n digits todetermine the next n-digit quotient or the square root extraction numberon the basis of the n-digit shift of the partial remainder. Similarly,the operation is repeatedly performed.

A division and square root extraction processing of such algorithms isdescribed, for example, in Kai Hwang, “High Speed Arithmetic System ofComputers”, 1980, Kindai Kagaku Sha Co., Ltd., pp. 214-249. Thisdocument discloses various division methods such as a restoringdivision, a non-restoring division, an SRT division and a generalizedSRT division.

SUMMARY

It is an objective of the invention to provide a method and a dataprocessing unit for performing an arithmetic operation in the dataprocessing unit, preferably by iterative digit accumulations, where themethod and data processing unit are optimized concerning executionperformance and hardware resource consumption.

Another objective is to provide a system for performing an arithmeticoperation in a data processing unit, preferably by iterative digitaccumulations, comprising such a data processing unit.

These objectives are achieved by the features of the independent claims.The other claims, the drawings and the specification discloseadvantageous embodiments of the invention.

According to a first aspect of the invention a method is proposed forperforming an arithmetic operation in a data processing unit, preferablyby iterative digit accumulations, comprising (i) computing iterativelyan approximate result of the arithmetic operation, (ii) computingconcurrently at least two supplementary values of the approximate resultof the arithmetic operation, and (iii) selecting a final result fromamong a set including the approximate result and the at least twosupplementary values of the arithmetic operation depending on theresults of a last iteration step of the iterative computation.

According to the invention, a supplementary value Q−2 of the approximateresult Q is additionally computed concurrently to the computation of Qand another supplementary value Q−1. This additional computation permitsa direct selection of the final result which might be decremented and/ornegated.

In particular, the invention relates to arithmetic operations,especially the accumulation of digits with MSD (Most Significant Digit)first using a given radix r (usually a power of 2) in data processingunits. As one embodiment, the arithmetic operation realized by theinnovative method can be a so-called SRT computation process. The SRTmethod is an iterative method which uses lookup tables to determinedigit values, which are used for computation of a result. The innovativemethod described here is especially adapted for using such a digit-wiseaccumulation process for determination of the result.

As an advantageous embodiment, the computations of quotients using SRTalgorithms is addressed. However, the invention is not restricted tosuch a division algorithm. Square-root operations may also be realizedwith the SRT algorithm. Other arithmetic operations employing digit-wiseaccumulation are specially suited to be used too.

The SRT division method is an iterative method similar to anon-restoring division, but it uses a lookup table based on the dividendand the divisor to determine quotient digit values. The SRT iterationformula for computing a partial remainder P is:∀i≧0,P _(i+1) =r*P _(i) −q _(i+1) *D  (1)where i is an iteration step, r is a radix (usually 4, 8, 10 or 16),P_(i) is a partial remainder, D is a normalized constant denominator,and q_(i) is a guessed quotient digit value. For simplification theindex i is only used in the following description where a specificiteration step is addressed; otherwise the indices of the respectivevalues are omitted.

The determination of quotient values Q_(i) thereby is as follows:Q _(i+1) =Q _(i) +q _(i+1) *r ^(−i+1) , with q ₀=0 and Q ₀=0  (2)There are different methods to accumulate the quotient digit valuesq_(i). In the invention the following method, also called an extendedcarry-less digit-wise accumulation, is used:

The q digit values are gathered in a Q and in a Q′=Q−1 data register incombination with q′=q−1 digit values. Finally, the correct result willeither be in the Q or the Q′ register. A supplementary iteration may beperformed to correct and/or negate the result eventually. In theinnovative method, a Q″=Q−2 is computed in using q″=q−2 digit values incombination with Q and Q′, which will be described in detail hereafter.The innovative method shows the advantage that the last correction ofthe result in the SRT division process may be performed by decrementinga quotient value Q for a negative remainder directly by selecting theappropriate Q′ or Q″ data register for output. Another advantage is thata potential inversion of the quotient value due to the signs of thedividend and divisor of the SRT division process may be achieved by atwo's complement notation: −Q−1−Q−1+1−Q−2.

A further advantage of the innovative method is that one iteration maybe saved for the correction of the quotient in SRT division, and anotheriteration may be saved for the negation of the result, becauseespecially for SRT operations, the correct result can be obtained byselecting one of the Q, Q′ or Q″ data registers.

Favorably the innovative method may comprise the following steps: (i)computing iteratively an approximate result Q of the arithmeticoperation by accumulating digit values q concatenated to a previouspartial result Q using a given radix r, (ii) computing iteratively atleast two supplementary values of the approximate result, Q−1 and Q−2,of the arithmetic operation by accumulating digit values q−1 and q−2,respectively, concatenated to previous supplementary values Q−1 and Q−2using the given radix r, (iii) computing concurrently a partialremainder value P of the arithmetic operation, (iv) selecting as a finalresult of the arithmetic operation one of the following. (iva) In case Pis greater or equal to zero and Q is greater or equal zero, the lastiterated value of Q will be selected. (ivb) In case P is less than zeroand Q is greater or equal zero, the last iterated value of Q−1 will beselected. (ivc) In case P is greater or equal zero and Q is less thanzero, the negated last iterated value of Q−1 will be selected and (ivd)in case P is less than zero and Q is less than zero, the negated lastiterated value of Q−2 will be selected as the final result.

In such a manner the final correction and/or negation steps of a usualSRT division process may be omitted because the final result may bedirectly selected from already computed values Q, Q−1, or Q−2 of thelast iteration step.

Favorably the absolute value of a digit value q is less than the radixr, which is a convenient definition in such iterative digitaccumulations, depending on the computing accuracies chosen.

According to another embodiment of the invention the method may furthercomprise the step of selecting the final result of the arithmeticoperation by using a multiplexing unit, which may have the result andthe at least two supplementary values as an input. Using a multiplexingunit as a selection tool may simplify and accelerate the selectionprocess of the final result.

Particularly the method may be used with the multiplexing unit connectedto at least two hardware lines for input of sign signals controlling theselecting process of the final result, which is a very efficient way ofdirectly selecting the appropriate input of the multiplexer as an outputfor the final result.

According to a another aspect of the invention a data processing unitfor performing the innovative method comprises two data registers forconcurrently computing the approximate result and the at least twosupplementary values of the arithmetic operation. The combination ofusing only two registers for doing digit-wise accumulations to computean approximate result and at least two supplementary values by theinnovative method enables great hardware efficiency. Additionally, onlya register with a limited number of log₂(r) bits to store the value q−1or q−1+r may be implemented, which for a given radix of 4 is only 2bits.

The proposed method may further be advantageously extended to computeany kind of result of the form Q±n, where n is a natural number. Theinvention may be implemented in using almost no supplementary hardware.Advantage will be taken from the fact that usually only Q, Q−1 and Q−2are needed for correction and/or negation of the final result. Themethod can employ only two full length data registers and additionallycosts only n log₂(r)-bit registers to store the q_(i)−n digit values.

Advantageously there is no complex logic, and no additional arithmeticoperation is needed. So the disclosed implementations represent a verysimple and straightforward method for iterative digit accumulation incomputing quite a number of arithmetic processes such as division,square-root extraction, addition, subtraction, multiplication.

Favorably a multiplexing unit may be used for selecting the final resultof the arithmetic operation, having the approximate result and the atleast two supplementary values as an input. Using a multiplexing unit asa selection tool may simplify and accelerate the selection process ofthe final result.

Advantageously the multiplexing unit may be connected to at least twohardware lines for input of sign signals controlling the selectingprocess of the final result, which is a very efficient way of directlyselecting the appropriate input of the multiplexer as an output for thefinal result.

In a further advantageous aspect of the invention a data processingprogram is proposed for execution in a data processing system,comprising an implementation of an instruction set for performing amethod as described above when the data processing program is run on acomputer.

Further a computer program product comprising a computer usable mediumincluding a computer readable program is proposed, wherein the computerreadable program when executed on a computer causes the computer toperform a method comprising the steps of computing iteratively anapproximate result of the arithmetic operation, computing concurrentlyat least two supplementary values of the approximate result of thearithmetic operation, and selecting the final result from one of thevalues of the approximate result and the at least two supplementaryvalues of the arithmetic operation depending on the results of the lastiteration step.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.”

Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Rash memory), a portable compactdisc read-only memory (CD-ROM), an optical storage device, a magneticstorage device, or any suitable combination of the foregoing. In thecontext of this document, a computer readable storage medium may be anytangible medium that can contain, or store a program for use by or inconnection with an instruction execution system, apparatus, or device. Acomputer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toblock diagrams of methods, apparatus (systems) and computer programproducts according to embodiments of the invention. It will beunderstood that each block of the flowchart illustrations and/or blockdiagrams, and combinations of blocks in the block diagrams, can beimplemented by computer program instructions. These computer programinstructions may be provided to a processor of a general purposecomputer, special purpose computer, or other programmable dataprocessing apparatus to produce a machine, such that the instructions,which execute via the processor of the computer or other programmabledata processing apparatus, create means for implementing thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the block diagram block orblocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the block diagram block orblocks.

Due to a further aspect of the invention, a data processing system forexecution of a data processing program is proposed, comprising softwarecode portions for performing a method described above.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The present invention together with the above-mentioned and otherobjects and advantages may best be understood from the followingdetailed description of the embodiments, but not restricted to theembodiments, wherein is shown in:

FIG. 1 a generalized process flow of an SRT division process accordingto the state of the art;

FIG. 2 an example embodiment of an SRT division process with extendedcarry-less digit-wise accumulation according to the invention;

FIG. 3 an implementation with two data registers of an SRT divisionprocess according to the exemplary embodiment of FIG. 2;

FIG. 4 depicts an exemplary embodiment according to FIG. 2 with threedata registers;

FIG. 5 depicts an exemplary embodiment according to FIG. 3 with only twodata registers; and

FIG. 6 depicts an exemplary embodiment of a data processing system forcarrying out a method according to the invention.

DETAILED DESCRIPTION

In the drawings, like elements are referred to with like referencenumerals. The drawings are merely schematic representations, notintended to portray specific parameters of the invention. Moreover, thedrawings are intended to depict only typical embodiments of theinvention and therefore should not be considered as limiting the scopeof the invention.

In FIG. 1 a generalized process flow of an SRT division processaccording to the state of the art is shown. The example depicts afixed-point division process for determining a quotient Q as well as aremainder R by calculating a value A divided by a value B. First apre-processing process 30 is done to determine the absolute values ofboth input values A and B. Then a normalizing process 32 takes placebefore the iterative SRT division process 34 starts with the absolutevalues |A| and |B|.

Iterative algorithms such as an SRT division process can be describedaccording to the following formulas for iterated quotient values Q_(i),which are expressed for the example of a fixed-point right aligneddivision process as:∀i≧0,Q _(i+1) =r*Q _(i) +q _(i+1)=Σ_(n=0) ^(i+1) q _(n) *r ^(i+1−n) ,Q₀=0,q ₀=0  (3)and for the example of a floating point left aligned division process:∀i≧0,Q _(i+1) =Q _(i) +q _(i+1) *r ^(−(i+1))=Σ_(n=0) ^(i+1) q _(n) *r^(−n) ,Q ₀=0,q ₀=0  (4)where i is an iteration step, r a radix (usually 4, 8, 10 or 16), P_(i)is a partial remainder, D a constant denominator and q_(i) a guessedquotient digit value. Equation (4) thereby corresponds to the alreadyshown equation (2) and exhibits a more detailed description.

Quotient digit values q_(i) can be determined according:∀i≧0,q _(min) ≦q _(i) ≦q _(max)  (5)with usually, but not necessarily−q _(min) =q _(max) <rwhereby the partial remainder value P_(i) may be determined accordingalready shown equation (1):∀i≧0,P _(i+1) =r*P _(i) −q _(i+1) *D  (1)

After having the result of the division process 34 a denormalizingprocess 36 delivers absolute values of the last iteration step for aquotient |Q_(last)| and a partial remainder |P_(last)|. A finalpost-processing step 38 corrects and/or negates the result according tothe signs of A and B, which are transferred from the pre-processing step30, and delivers the final results for the quotient Q and the remainderR. One advantage of the invention is that the final post-processing step38 may be eliminated because the determination of the final results Qand R can be selected directly from the last iteration step values.

FIG. 2 shows an example embodiment of an SRT division process withextended carry-less digit-wise accumulation according to the invention.The iterative computation of the different quotient values Q, Q−1 andQ−2 specific for the innovative process is performed according to thefollowing formulas.

An iterative value for the guessed quotient value Q, is computedaccording equation (3), because a fixed point right aligned divisionprocess is described here:

$\begin{matrix}{{\forall q_{i + 1}},{Q_{i + 1} = {{{r*Q_{i}} + q_{i + 1}} = {\sum\limits_{n = 0}^{i + 1}\;{q_{n}*r^{i + 1 - n}\left\{ \begin{matrix}{{\forall{q_{i + 1} \geq 0}},} & {Q_{i + 1} = \left. {r*Q_{i}}||q_{i + 1} \right.} \\{{\forall{q_{i + 1} < 0}},} & {Q_{i + 1} = \left. {r*\left( {Q_{i} - 1} \right)}||\left( {q_{i + 1} + r} \right) \right.}\end{matrix} \right.}}}}} & (3)\end{matrix}$where the symbol ∥ characterizes a concatenation step with a left shiftby log₂(r) bits, e.g. for radix 4, a left shift by 2 bits.

The quotient value Qi−1 is computed like this:

$\begin{matrix}{{\forall q_{i + 1}},{{Q_{i + 1} - 1} = {{{r*Q_{i}} + \left( {q_{i + 1} - 1} \right)} = {{\sum\limits_{n = 0}^{i + 1}\;{q_{n}*r^{i + 1 - n}}} - {1\left\{ \begin{matrix}{{\forall{q_{i + 1} \geq 1}},} & {{Q_{i + 1} - 1} = \left. {r*Q_{i}}||\left( {q_{i + 1} - 1} \right) \right.} \\{{\forall{q_{i + 1} < 1}},} & {{Q_{i + 1} - 1} = \left. {r*\left( {Q_{i} - 1} \right)}||\left( {q_{i + 1} + r - 1} \right) \right.}\end{matrix} \right.}}}}} & (6)\end{matrix}$whereas for the quotient values Q_(i)−2 the following formula applies:

$\begin{matrix}{{\forall q_{i + 1}},{{Q_{i + 1} - 2} = {{{r*Q_{i}} + \left( {q_{i + 1} - 2} \right)} = {{\sum\limits_{n = 0}^{i + 1}\;{q_{n}*r^{i + 1 - n}}} - {2\left\{ \begin{matrix}{{\forall{2 \leq q_{i + 1} < {2 + r}}},} & \left. {Q_{i + 1} - 2 - {r*Q_{i}}}||\left( {q_{i + 1} - 2} \right) \right. \\{{\forall{{2 - r} \leq q_{i + 1} < 2}},} & {{Q_{i + 1} - 2} = \left. {r*\left( {Q_{i} - 1} \right)}||\left( {q_{i + 1} + r - 2} \right) \right.} \\{{\forall{{2 - {2\; r}} \leq q_{i + 1} < {2 - r}}},} & {{Q_{i + 1} - 2} = \left. {r*\left( {Q_{i} - 2} \right)}||\left( {q_{i + 1} + {2\; r} - 2} \right) \right.}\end{matrix} \right.}}}}} & (7)\end{matrix}$

In FIG. 2 mainly three data registers 50, 51, 52 are shown for thecomputation of the different quotient values Q, Q−1 and Q−2. Forsimplicity the indices of the different Q values are omitted in thedescription, where appropriate. The input to these registers 50, 51, 52is done by appropriate multiplexing units 40, 41, 42, respectively. Asthe SRT process is a recursive process the output of the differentregisters 50, 51, 52 is fed back via data lines 63, 64, 65 to the inputof the multiplexing units 40, 41, 42 in order to compute a new iterationstep. Additionally Q−1 is an input to multiplexing unit 40 via data line70, whereas Q is an input to multiplexing unit 41 via data line 71, andboth Q and Q−1 are an input to multiplexing unit 42 via data lines 73and 72, respectively. Additionally quotient digit values q, q+r, q−1,q+r−1, q−2, q+r−2, q+2r−2, which are results from guesses from a lookuptable 20, are fed to multiplexing units 43, 44, 45 via data lines 74,75, 76, 77, 78, 79, 80, respectively. The q values are stored in dataregisters 53, 54, 55 for starting a concatenating process. The selectionof the appropriate values in the multiplexing units 40 to 45 isperformed according to the formulas for the computation of Q, Q−1, Q−2given above. In order to proceed the iteration process to the next step,for example, the q value form register 53 is concatenated with theoutput of register 50, i.e. left shifted by log₂(2) bits via data line60, and the result fed back as an input to multiplexing units 40, 41 42.Similarly the concatenation processes are performed with the other tworegister units 51 and 54 via data line 61 and 52 and 55 via data line62. The results of the iteration process finally after the lastiteration step are fed to multiplexing unit 46 via data lines 66 for Qand data lines 67 and 68 for Q−1. Data lines 68 and 69 delivers Q−1 andQ−2 to negated input ports of multiplexing unit 46. The final result ofthe quotient Q can then be determined by multiplexing unit 46 selectingfrom the results of the last iteration step according to the followingformulas:P _(last)>0

Q _(last)>0,

Q=Q _(last)P _(last)>0

Q _(last)≧0,

Q=(Q _(last)−1)P _(last)>0

Q _(last)<0,

Q=−(Q _(last))=(Q _(last)−1)P _(last)>0

Q _(last)<0,

Q=−(Q _(last))=(Q _(last)−1)=(Q _(last)−2)  (8)

In case P is greater or equal to zero and Q is greater or equal zero,the last iterated value of Q will be selected. In case P is less thanzero and Q is greater or equal zero, the last iterated value of Q−1 willbe selected. In case P is greater or equal zero and Q is less than zero,the negated last iterated value of Q−1 will be selected; and in case Pis less than zero and Q is less than zero, the negated last iteratedvalue of Q−2 will be selected as the final result. In such a manner thefinal correction and/or negation steps of a usual SRT division processmay be neglected, because the final result may be directly selected fromalready computed values Q, Q−1, or Q−2 of the last iteration step.

Besides the inputs from the data lines 66 to 69 for Q, Q−1, −(Q−1), and−(Q−2), multiplexing unit 46 additionally has at least two hardwareinput lines 100 which feed an input signal for P_(last)<0 and theexclusive-or input of sign(A)⊕sign(B), where A and B are the dividendand divisor of the SRT division process as defined above. The partialremainder values P are computed in a parallel process according to theformula given above. By this method the final result correction and/ornegation step can be eliminated and can be replaced by a simple and fastselection step in the multiplexing unit 46.

In FIG. 3 an implementation of an SRT division process according to theexample embodiment of FIG. 2 is described. A further advantage of thedescribed method is that only two data registers 50 and 52 aresufficient to handle the iteration process. The data register for theQ−1 computation may be eliminated because this value is available eitherin data register 50 from the last Q value or in data register 52 fromthe last Q−2 value respectively. Therefore, an additional data line 82from data register 50 as well as an additional data line 84 from dataregister 52 are fed to a multiplexing unit 56 which selects theappropriate value Q−1 for input to the multiplexing unit 46. In thisway, only two full data registers 50 and 52 are sufficient to cover theiteration process, in addition to the small register 54 with a bitlength of log₂(r) and an additional multiplexing unit 56, which is avery hardware-efficient implementation of such a process. For simplicitynot all data lines are shown compared to FIG. 2, but all other functionsare meant as described in FIG. 2.

The embodiment shown in FIGS. 2 and 3 is the example of an SRT divisionprocess. Yet the method is not restricted to such a process, but insteadis applicable to any iterative method for computation of a number withdigit-wise accumulations, e.g., computation of square-roots or generallyother processes including addition, subtraction, or multiplication.

In FIG. 4 a numeric example of an embodiment according to FIG. 2 withthree data registers is shown in order to explain the method in moredetail with real numbers. Column 110 shows different q₁₊₁ quotient digitvalues according to an implementation of the inventive method with anSRT division process with radix 4. As given above q₁₊₁ may be determinedaccording to −r<q₁₊₁<r, which means that q_(i+1) can range from −3 to 3(−3 is not used in the example shown). Column 111 shows a data registerwith the computed quotient values for Q, column 114 shows a dataregister for Q′=Q−1, and column 117 shows a data register for Q″=Q−2.The values are determined according to the equationsQ _(i+1) =r*Q _(i) +q _(i)Q′ _(i+1) =r*Q′ _(i) +q′ _(i)Q″ _(i+1) =r*Q″ _(i) +q″ _(i)where q′_(i+1)=q_(i+1)−1 and q″_(i+1)=q_(i+1)−2. The columns 112, 115,118 represent the data registers with the values of q, q′, q″,respectively, in digits (indices are omitted). Columns 113, 116, 119show the respective values of Q, Q′, Q″ in decimal representation. As astarting point, Q value 111 and q value 112 are set to zero. Thenaccording to the first q_(i+1) value 110 of 2, a new set of quotientvalues are computed according to equation (9). Afterwards the iterationproceeds with the next q_(i+1) value 110 and so on, until an appropriateaccuracy is achieved. In FIG. 4 the quotient values that are derivedfrom the previous Q values 111 are boxed with a continuous line, whereasthe quotient values that are derived from the previous Q′ values 114 areboxed with a dashed line.

FIG. 5 shows the same numeric example of an embodiment with a preferredimplementation according to FIG. 3 with only two data registers. In FIG.5, the data register with the Q′ values 114 is omitted. As can be seenin the example the same result can be obtained with feeding the dataregisters for Q 111 and Q″ 117 with the appropriate value for Q′, whichis available either in a previous Q 111 or a Q″ 117 data register. Onlythe two-bit data register 115 for the q′ values is needed forimplementation of the described method. The same notation for continuousand dashed boxes as in FIG. 4 are employed, continuous lines forquotient values derived from previous Q values and dashed lines forquotient values derived from previous Q′ values. As can be seen in theend the same values for the quotient values may be obtained by thisimplementation.

Referring now to FIG. 6, a schematic of an example of a data processingsystem 210 is shown. Data processing system 210 is only one example of asuitable data processing system and is not intended to suggest anylimitation as to the scope of use or functionality of embodiments of theinvention described herein. Regardless, data processing system 210 iscapable of being implemented and/or performing any of the functionalityset forth herein above.

In data processing system 210 there is a computer system/server 212,which is operational with numerous other general purpose or specialpurpose computing system environments or configurations. Examples ofwell-known computing systems, environments, and/or configurations thatmay be suitable for use with computer system/server 212 include, but arenot limited to, personal computer systems, server computer systems, thinclients, thick clients, handheld or laptop devices, multiprocessorsystems, microprocessor-based systems, set top boxes, programmableconsumer electronics, network PCs, minicomputer systems, mainframecomputer systems, and distributed cloud computing environments thatinclude any of the above systems or devices, and the like.

Computer system/server 212 may be described in the general context ofcomputer system executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 212 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 6, computer system/server 212 in data processing system210 is shown in the form of a general-purpose computing device. Thecomponents of computer system/server 212 may include, but are notlimited to, one or more processors or processing units 216, a systemmemory 228, and a bus 218 that couples various system componentsincluding system memory 228 to processor 216.

Bus 218 represents one or more of any of several types of busstructures, including a memory bus or memory controller, a peripheralbus, an accelerated graphics port, and a processor or local bus usingany of a variety of bus architectures. By way of example, and notlimitation, such architectures include Industry Standard Architecture(ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA)bus, Video Electronics Standards Association (VESA) local bus, andPeripheral Component Interconnect (PCI) bus.

Computer system/server 212 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 212, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 228 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 230 and/or cachememory 232. Computer system/server 212 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 234 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 218 by one or more datamedia interfaces. As will be further depicted and described below,memory 228 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 240, having a set (at least one) of program modules 242,may be stored in memory 228 by way of example, and not limitation, aswell as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. Program modules 242 generally carry out the functionsand/or methodologies of embodiments of the invention as describedherein. Computer system/server 212 may also communicate with one or moreexternal devices 214 such as a keyboard, a pointing device, a display224, etc.; one or more devices that enable a user to interact withcomputer system/server 212; and/or any devices (e.g., network card,modem, etc.) that enable computer system/server 212 to communicate withone or more other computing devices. Such communication can occur viaInput/Output (I10) interfaces 222. Still yet, computer system/server 212can communicate with one or more networks such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet) via network adapter 220. As depicted, network adapter 220communicates with the other components of computer system/server 212 viabus 218. It should be understood that although not shown, other hardwareand/or software components could be used in conjunction with computersystem/server 212. Examples, include, but are not limited to: microcode,device drivers, redundant processing units, external disk drive arrays,RAID systems, tape drives, and data archival storage systems, etc.

The block diagrams in the figures illustrate the architecture,functionality, and operation of possible implementations of systems,methods and computer program products according to various embodimentsof the present invention. In this regard, each block in the blockdiagrams may represent a module, segment, or portion of code, whichcomprises one or more executable instructions for implementing thespecified logical functions. It should also be noted that, in somealternative implementations, the functions noted in the block may occurout of the order noted in the figures. For example, two blocks shown insuccession may, in fact, be executed substantially concurrently, or theblocks may sometimes be executed in the reverse order, depending uponthe functionality involved. It will also be noted that each block of theblock diagrams, and combinations of blocks in the block diagrams, can beimplemented by special purpose hardware-based systems that perform thespecified functions or acts, or combinations of special purpose hardwareand computer instructions.

What is claimed is:
 1. A method for performing an arithmetic operationin a data processing unit, the method comprising: the data processingunit iteratively computing an approximate result of the arithmeticoperation; concurrently with the iteratively computing, the dataprocessing unit computing at least two supplementary values of theapproximate result of the arithmetic operation; and the data processingunit selecting a final result of the arithmetic operation from among aset including the approximate result and the at least two supplementaryvalues depending on a result of a last iteration of the iterativelycomputing.
 2. The method according to claim 1, wherein the arithmeticoperation is an SRT (Sweeney, Robertson, and Tocher) computationprocess.
 3. The method according to claim 1, wherein the arithmeticoperation is a division operation.
 4. The method according to claim 1,wherein the arithmetic operation is a square-root operation.
 5. Themethod according to claim 1, wherein the arithmetic operation is one ofan addition, a subtraction, or a multiplication operation.
 6. The methodaccording to claim 1, wherein: the iteratively computing the approximateresult comprises iteratively computing an approximate result Q of thearithmetic operation by accumulating digit values q concatenated to aprevious approximate result Q using a given radix r; computing at leasttwo supplementary values comprises computing iteratively the at leasttwo supplementary values of the approximate result, Q−1 and Q−2, byaccumulating digit values q−1 and q−2, respectively, concatenated toprevious supplementary values Q−1 and Q−2 using the given radix r; themethod further comprises computing concurrently a remainder value P ofthe arithmetic operation; the selecting the final result comprises: inresponse to P being greater than or equal to zero and Q being greaterthan or equal to zero, selecting as the final result a value of Q forthe last iteration; in response to P being less than zero and Q beinggreater than or equal to zero, selecting as the final result a value ofQ−1 for the last iteration; in response to P being greater than or equalto zero and Q being less than zero, a negation of a value of Q−1 for thelast iteration; and in response to P being less than zero and Q beingless than zero, selecting as the final result a negation of a value ofQ−2 for the last iteration.
 7. The method according to claim 6, andfurther comprising selecting the digit values q from a lookup table. 8.The method according to claim 6, wherein an absolute value of the digitvalues q is less than the radix r.
 9. The method according to claim 1,wherein selecting the final result comprises selecting the final resultusing a multiplexing unit having the approximate result and the at leasttwo supplementary values as inputs.
 10. The method according to claim 9,wherein the selecting the final result includes the multiplexing unitselecting the final result in response to at least two hardware linesindicating operand signs.